Combinatorial optimization in geometry

In this paper we extend and unify the results of [20] and [19]. As a consequence, the results of [20] are generalized from the framework of ideal polyhedra in H to that of singular Euclidean structures on surfaces, possibly with an infinite number of singularities (by contrast, the results of [20] can be viewed as applying to the case of non-singular structures on the disk, with a finite number of distinguished points). This leads to a fairly complete understanding of the moduli space of such Euclidean structures and thus, by the results of Epstein, Penner, ([15; 7; 13]) the author [19; 18], and others, further insights into the geometry and topology of the Riemann moduli space. The basic objects studied are the canonical Delaunay triangulations associated to the aforementioned Euclidean structures. The basic tools, in addition to the results of [19] and combinatorial geometry are methods of combinatorial optimization – linear programming and network flow analysis; hence the results mentioned above are not only effective but also efficient. Some applications of these methods to three-dimensional topology are also given (to prove a result of Casson’s).